Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem
نویسندگان
چکیده
منابع مشابه
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time scaling algorithms for the minimization of an M-convex function. Both algorithms apply a scaling technique to a greedy algorithm for M-convex function minimization, and run as fast as the previous minimization algorithms. We ...
متن کاملScaling Algorithms for M - convex Function Minimization
M-convex functions have various desirable properties as convexity in discrete optimization. We can find a global minimum of an M-convex function by a greedy algorithm, i.e., so-called descent algorithms work for the minimization. In this paper, we apply a scaling technique to a greedy algorithm and propose an efficient algorithm for the minimization of an M-convex function. Computational result...
متن کاملMinimization of an M-convex Function
We study the minimization of an M-convex function introduced by Murota. It is shown that any vector in the domain can be easily separated from a minimizer of the function. Based on this property, we develop a polynomial time algorithm.
متن کاملOn Hochbaum’s Scaling Algorithm for the General Resource Allocation Problem
We point out that the polynomial-time scaling algorithm by Hochbaum (1994) does not work correctly for the general resource allocation problem. We discuss the reason for the failure by certain examples, and modify the algorithm so that it works correctly. Satoko MORIGUCHI: Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, 152-8552, Japan, Satoko.Moriguchi@...
متن کاملMarket and Resource Allocation Algorithms with Application to Energy Control
The energy markets of today are markets with rather few active participants. The participants are, with few exceptions, large producers and distributors. The market mechanisms that are used are constructed with this kind of a market situation in mind. With an automatic or semiautomatic approach, the market mechanism would be able to incorporate a larger number of participants. Smaller producers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00255-5